A New Method of Complete Data Reduction Based on the Boolean Matrix 一种基于布尔矩阵的新的属性约简完备算法
An Algorithm for Attribute Reduction in Rough Sets Based on Boolean Matrix 基于布尔矩阵表示的粗糙集属性约简算法
A Novel Construction Method for Large-Scale Boolean Matrix in Multivariate Public-Key Cryptosystem 多变量密码中布尔矩阵的一种新的构造方法
Algorithm of generating large-scale Boolean matrix in multivariate public-key cryptosystems 多变量密码体制下大型布尔矩阵生成算法
A fast algorithm for mining fo association rules based on boolean matrix 一种基于布尔矩阵的关联规则快速挖掘算法
The relationship between the attribute set of decision table, Boolean matrix and resolve of logic equation set is set up. 建立了布尔矩阵与逻辑方程组的解和决策表中的属性集之间的关系;
Some properties of Boolean matrix space and the g-inverse space of a regu-lar Boolean matrix are investigated. 研究了布尔矩阵空间和正则布尔矩阵的g-逆线性空间的一些性质。
The eigenvalue and eigenvector of Boolean matrix 布尔矩阵的特征值和特征向量
On a lattice inverse isomorphism of row space and column space in Boolean matrix 布尔矩阵的行与列空间的一种格反同构
Boolean matrix representation of rough set in decision table 决策表中粗糙集的布尔矩阵表示
Reachability matrix is an effective tool for identifying whether a directed graph to be strongly or weakly connected graph, it provides the calculating method of reachable matrix with the property of the Boolean matrix operation, the calculation method is easy and simple. 可达矩阵是判别一个有向图是否为强连通图或弱连通图的有效工具.利用布尔矩阵的运算性质给出了计算有向图可达矩阵的方法,该方法计算简便。
The Sharp ordering in Boolean matrix set is discussed. Some characterizations and properties of the Sharp ordering are given. 讨论了布尔矩阵集中的Sharp序,并给出了Sharp序的一些刻划和性质。
On the AFS theory, we define a homomorphism mapping between the EI algebra and the ring of Boolean matrix. Some attribute and some new methods of studying the Sub algebra are found out at the same time. 本文在AFS理论的基础上,给出了EI代数和布尔矩阵环之间的一个同态关系,并且找到了子代数的一些性质和研究子代数的新方法。
In this paper, basic theory of the sticker model was introduced, then we gave the information representative method of Boolean matrix and realized Boolean sum operation based on sticker model. The proposed method demonstrated the massive parallelism of DNA computing. 介绍粘贴模型的数据表示方法;给出了利用粘贴模型表示布尔矩阵,实现了布尔和运算,充分反映了DNA计算的巨大并行性。
Let A be an n × n irreducible Boolean matrix with period p. In [ 1], the generalized maximum density index h A ( k) is defined. 设A是一个周期为p的n×n不可约布尔矩阵,[3]中定义了A的广义最大密度指数hA(k)。
The Approaches to the Boolean Matrix and EI Algebra Representation of Concepts 概念的EI代数表示和布尔矩阵表示的研究
By means of Boolean matrix operation method, a study is made of defining the prime implicant of multi output function and the operation routine of the method is illustrated with some examples. 运用布尔矩阵运算的方法对确定多输出函数的质蕴涵进行了研究,并通过示例说明了这种方法的运算程序。
This model was composed of a tracking process model based on activity network diagram and multi sub closed loop processes, a Boolean matrix description model of tracking sections and associations among sections, a matrix style organization structure and a quality problem driven organization model. 该模型包含基于活动网络图的多个闭环子过程的追踪过程模型、追踪过程节点及节点间联系的布尔矩阵描述模型,以及矩阵式的管理组织结构和以质量问题为驱动的组织模型。
Based on the network graph theory, applying Boolean matrix theory, this paper introduces the mathematical model of electrical connectedness analyzing the main electrical scheme in substation. 正是基于这一需求,在网络图论的基础上,运用布尔矩阵理论提出了变电所一次主接线电气连通性分析的数学模型。
This paper defines the Boolean matrix, puts forward the standard model of tree, uses the standard model to generate the defining method and the algorithm of a tree, and then realizes the algorithm with computer. 定义了图的布尔矩阵,给出了树的标准型,并且应用标准型给出了树的判定方法和算法,用计算机实现了该算法。
Some theorems were discussed and boolean matrix characters on β_0 of cycle code were presented in this paper. 布尔矩阵是一类重要的应用矩阵,循环码矩阵是一类重要的布尔矩阵.文章将讨论并给出循环码矩阵在β0上的一些性质。
An enhanced Apriori algorithm which directly used the row vectors of boolean matrix for transaction databases to find out the frequent item sets was presented in this paper. 针对Apriori算法寻找频繁项集问题,通过对事务数据库的布尔化表示,提出了一种直接利用布尔矩阵的行向量去搜寻频繁项集的思想。
On the sub-algebra of EI algebra, we have discussed the EI algebra representations of the concepts and the Boolean matrix representations of the concepts. 在EI代数的子代数的基础上,对概念的EI代数表示和布尔矩阵表示进行了讨论。对模糊概念的表示进行了进一步研究。
An algorithm to compute follow set with the boolean matrix is given. 文中给出一种用布尔矩阵计算Follow集合的算法。
The paper builds the relationship of attribute set, Boolean matrix and logic equation set. 建立了属性集与布尔矩阵以及逻辑方程组的解之间的关系;
The transitive index of irreducible Boolean matrix 关于不可约布尔矩阵的传递指数
The algorithm is composed of4steps: Boolean matrix construction, matrix compression, frequent item pairs extraction and correlated items pairs extraction. 算法TaperC主要分为四个部分:布尔矩阵的构建、压缩矩阵、频繁项目对的提取和相关项目对的提取。
In addition, because the permutation matrix is a special Boolean matrix, the question that the result of three basic Boolean operations between permutation matrices is still or not a permutation matrix is also discussed. 此外,由于置换矩阵是特殊的布尔矩阵,所以还讨论了置换矩阵间的三种布尔运算是否仍为置换矩阵的问题。
On this basis, new method of complete data reduction based on Boolean matrix is put forward. In order to get the minimum reduction in information system, this paper adds the converse delete action until cannot delete, this guarantee the completeness of the algorithm. 基于此理论本文提出了一种基于布尔矩阵的新的属性约简完备算法,为了保证算法的完备性,在此基础上加了一个反向删除过程,直到不能再删为止,保证了算法的完备性。
Professor Li demonstrated that attribute reduction is equivalent in the two different forms of the Boolean matrix and algebra, but Boolean matrix is more intuitive and can reduce the storage space. 李龙星等教授证明了属性约简在布尔矩阵和代数两种不同表示下是等价的,布尔矩阵表示更加直观且可以减少存储空间。